Learning Weight Signed Network Embedding with Graph Neural Networks

نویسندگان

چکیده

Abstract Network embedding aims to map nodes in a network low-dimensional vector representations. Graph neural networks (GNNs) have received much attention and achieved state-of-the-art performance learning node representation. Using fundamental sociological theories (status theory balance theory) model signed networks, basing GNN on has become hot topic embedding. However, most GNNs fail use edge weight information models cannot be directly used weighted networks. We propose novel directed graph named WSNN learn for Weighted The proposed reconstructs link signs, directions, triangles simultaneously. Based the representations learned by model, we conduct sign prediction Extensive experimental results real-world datasets demonstrate superiority of over algorithms representation

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SNE: Signed Network Embedding

Several network embedding models have been developed for unsigned networks. However, these models based on skip-gram cannot be applied to signed networks because they can only deal with one type of link. In this paper, we present our signed network embedding model called SNE. Our SNE adopts the log-bilinear model, uses node representations of all nodes along a given path, and further incorporat...

متن کامل

Few-Shot Learning with Graph Neural Networks

We propose to study the problem of few-shot learning with the prism of inference on a partially observed graphical model, constructed from a collection of input images whose label can be either observed or not. By assimilating generic message-passing inference algorithms with their neural-network counterparts, we define a graph neural network architecture that generalizes several of the recentl...

متن کامل

Signed Network Embedding in Social Media

Network embedding is to learn low-dimensional vector representations for nodes of a given social network, facilitating many tasks in social network analysis such as link prediction. The vast majority of existing embedding algorithms are designed for unsigned social networks or social networks with only positive links. However, networks in social media could have both positive and negative links...

متن کامل

Signed Digit Counters with Neural Networks

In this paper we investigate no learning based neural networks for signed digit counters. We first assume radix-2 signed digit inputs and prove that a pj([log p] + 1) can be implemented with a depth-2 neural network with at most p + 2[log p] + 3 neural gates and the maximum weight and fan-in values in the order of O(p). Under the same assumption we investigate 7j2 counters and we propose an exp...

متن کامل

Learning Graph Representations with Embedding Propagation

Label Representations • Let l ∈ Rd be the representation of label l, and f be a differentiable embedding function • For labels of label type i, we apply a learnable embedding function l = fi(l) • hi(v) is the embedding of label type i for vertex v: hi(v) = gi ({l | l ∈ labels of type i associated with vertex v}) • h̃i(v) is the reconstruction of the embedding of label type i for vertex v: h̃i(v) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Data Science and Engineering

سال: 2023

ISSN: ['2364-1541', '2364-1185']

DOI: https://doi.org/10.1007/s41019-023-00206-x